class MycircularQueue {
    public int[] elem;
    public int usedSize ;
    public int front;
    public int rear;
    public void MyCircularQueue(int k) {
        this.elem = new int[k+1];
    }
    
    public boolean enQueue(int value) {
        if (isFull()){
            return false;
        }
        this.elem[rear] = value;
        rear=(rear+1)%elem.length;
        return true;
    }
    
    public boolean deQueue() {
        if (isEmpty()){
            return false;
        }
        front=(front+1)%elem.length;
        return true;
    }
    
    public int Front() {
        if (isEmpty()){
            return -1;
        }
        return elem[front];
    }
    
    public int Rear() {
        if (isEmpty()){
            return -1;
        }
        return elem[(rear-front+elem.length)%elem.length];
    }
    
    public boolean isEmpty() {
        if (rear==front){
            return true;
        }
        return false;
    }
    
    public boolean isFull() {
       if (front==(rear+1)%elem.length){
           return true;
       }
       return false ;
    }
}